Turing machine - PDFSEARCH.IO - Document Search Engine

Turing machine
Results: 564

#	Item
221	Automata theory Regular Cost Functions Contributions of the thesis Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-12-02 12:39:02 Mathematics Automata theory Models of computation Theory of computation Church–Turing thesis Finite-state machine Algorithm Decidability Krohn–Rhodes theory Theoretical computer science Computer science Computability theory
222	AUTOMATA Thus far we have been concerned with two major topics: the discovery of an appropriate model for computation and an examination of the intrinsic properties of computation in general. We found that since Turing m Add to Reading List Source URL: www.cs.uky.edu Language: English - Date: 2001-02-14 12:47:25 Automata theory Computer science Computability theory Turing machine Finite-state machine Linear bounded automaton Decision problem Theory of computation Theoretical computer science Models of computation
223	Overview Lecture T2: Turing Machines Attempt to understand essential nature of computation by studying properties of simple machine models. Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-02-02 11:59:52 Automata theory Turing machine Computer science Deterministic pushdown automaton Finite-state machine Linear bounded automaton National Parliamentary Debate Association NP Pushdown automaton Theory of computation Models of computation Theoretical computer science
224	Working with YANG Data Models and Instances Using (Mainly) pyang Ladislav Lhotka ⟨[removed]⟩ 20 July 2014 Add to Reading List Source URL: www.ietf.org Language: English - Date: 2014-11-24 12:13:14 Turing machine XML XML schema JSON Turing Emacs JavaScript Computing Software Markup languages
225	Post-publication version of “Aaron Sloman develops a distinctive view of – Virtual Machinery and Evolution of Mind (Part 1)” pages[removed]In Alan Turing - His Work and Impact, eds S. B. Cooper & J. van Leeuwen, Els Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2013-09-07 19:32:51 Turing machine Models of computation Computability theory Alan Turing Virtual machine Turing completeness VM Computability Programming language Theoretical computer science Computer science Theory of computation
226	What does the Turing test really mean? And how many human beings (including Turing) could pass? By Tyler Cowen and Michelle Dawson1 June 3, 2009 Alan Turing’s short 1950 paper in Mind, “Computing Machinery and Intell Add to Reading List Source URL: www.gmu.edu Language: English - Date: 2009-06-24 17:31:06 Science Philosophy of artificial intelligence Computability theory Turing machine Theory of computation Turing test Computing Machinery and Intelligence Universal Turing machine Reverse Turing test Alan Turing Artificial intelligence Computer science
227	Draft invited presentation at: Pierre Duhem Conference (Society for Philosophy of Science), Tuesday 19th July 2011, Nancy, France, http://www.sps-philoscience.org/activites/activite.php?id=15 Evolution of mind as a feat Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2011-07-15 22:05:05 Models of computation Virtual machines Programming language implementation Turing machine VM Simulation Communications protocol Alan Turing Programming language System software Computing Software
228	Universal Turing Machine A Turing machine that is able to simulate any other Turing machine is called a Universal Turing machine. The concept of the Turing machine is based on the idea of a person executing a well-define Add to Reading List Source URL: betatype.com Language: English - Date: 2015-03-08 13:02:07 Computer science Alan Turing Computational complexity theory Read-only Turing machine Non-deterministic Turing machine Turing machine Theory of computation Theoretical computer science
229	CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa Add to Reading List Source URL: levine.sscnet.ucla.edu Language: English - Date: 2006-03-16 11:03:47 Applied mathematics Alan Turing Turing machine Theory of computation Models of computation Computability NP Machine that always halts Halting problem Theoretical computer science Computability theory Mathematics
230	What is an algorithm? Yuri Gurevich Microsoft Research Technical Report MSR-TR[removed], July 2011 Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-02-23 13:32:36 Computability theory Applied mathematics Alan Turing Formal methods Models of computation Algorithm Church–Turing thesis Computable function Turing machine Theoretical computer science Computer science Theory of computation

UPDATE